APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items
نویسنده
چکیده
We study the problem of allocating a set of indivisible items to agents with additive utilities to maximize the Nash social welfare. Cole and Gkatzelis [3] recently proved that this problem admits a constant factor approximation. We complement their result by showing that this problem is APX-hard.
منابع مشابه
Greedy Algorithms for Maximizing Nash Social Welfare
We study the problem of fairly allocating a set of indivisible goods among agents with additive valuations. The extent of fairness of an allocation is measured by its Nash social welfare, which is the geometric mean of the valuations of the agents for their bundles. While the problem of maximizing Nash social welfare is known to be APX-hard in general, we study the effectiveness of simple, gree...
متن کاملApproximating the Nash Social Welfare with Budget-Additive Valuations
We present the first constant-factor approximation algorithm for maximizing the Nash social welfare when allocating indivisible items to agents with budget-additive valuation functions. Budgetadditive valuations represent an important class of submodular functions. They have attracted a lot of research interest in recent years due to many interesting applications. For every ε > 0, our algorithm...
متن کاملEnvy-ratio and average-nash social welfare optimization in multiagent resource allocation
The resource allocation problem deals with distributing a number of indivisible, nonshareable resources among a set of agents so as to optimizing social welfare. Assuming all agents to have additive utility functions and focusing on two particular measures of social welfare, envy-ratio and average-Nash product, we investigate the two resulting optimization problems. We give the first hardness o...
متن کاملNash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities
Recently Cole and Gkatzelis [CG15] gave the first constant factor approximation algorithm for the problem of allocating indivisible items to agents, under additive valuations, so as to maximize the Nash social welfare (NSW). We give constant factor algorithms for a substantial generalization of their problem – to the case of separable, piecewise-linear concave utility functions. We give two suc...
متن کاملThe Price to Pay for Forgoing Normalization in Fair Division of Indivisible Goods
We study the complexity of fair division of indivisible goods and consider settings where agents can have nonzero utility for the empty bundle. This is a deviation from a common normalization assumption in the literature, and we show that this inconspicuous change can lead to an increase in complexity: In particular, while an allocation maximizing social welfare by the Nash product is known to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 122 شماره
صفحات -
تاریخ انتشار 2017